Rabinizer: Small Deterministic Automata for LTL(F, G)
نویسندگان
چکیده
We present Rabinizer, a tool for translating formulae of the fragment of linear temporal logic with the operators F (eventually) and G (globally) into deterministic Rabin automata. Contrary to tools like ltl2dstar, which translate the formula into a Büchi automaton and apply Safra’s determinization procedure, Rabinizer uses a direct construction based on the logical structure of the formulae. We describe a number of optimizations of the basic procedure, crucial for the good performance of Rabinizer, and present an experimental comparison.
منابع مشابه
Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment
Some applications of linear temporal logic (LTL) require to translate formulae of the logic to deterministic ω-automata. There are currently two translators producing deterministic automata: ltl2dstar working for the whole LTL and Rabinizer applicable to LTL(F,G) which is the LTL fragment using only modalities F and G. We present a new translation to deterministic Rabin automata via alternating...
متن کاملComparison of LTL to Deterministic Rabin Automata Translators
Increasing interest in control synthesis and probabilistic model checking caused recent development of LTL to deterministic ω-automata translation. The standard approach represented by ltl2dstar tool employs Safra’s construction to determinize a Büchi automaton produced by some LTL to Büchi automata translator. Since 2012, three new LTL to deterministic Rabin automata translators appeared, name...
متن کاملDeterministic Automata for the (F, G)-Fragment of LTL
When dealing with linear temporal logic properties in the setting of e.g. games or probabilistic systems, one often needs to express them as deterministic omega-automata. In order to translate LTL to deterministic omega-automata, the traditional approach first translates the formula to a non-deterministic Büchi automaton. Then a determinization procedure such as of Safra is performed yielding a...
متن کاملAutomata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless translation [KE12,GKE12] for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach. In this work, instead of DRW we consider deterministic automata with acceptance condition given as disjunction of generaliz...
متن کاملGenerating Deterministic ω-Automata for most LTL Formulas by the Breakpoint Construction
Temporal logics like LTL are frequently used for the specification and verification of reactive systems. To this end, LTL formulas are typically translated to nondeterministic Büchi automata so that the LTL verification problem is reduced to a nonemptiness problem of ω-automata. While nondeterministic automata are sufficient for this purpose, many other applications require deterministic ω-auto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012